A new improved flexible segmentation algorithm using local cosine transform

To the problem of no overall optimal merger for one-way merger in the segmentation algorithm proposed by Wang Yongzhong, et al., in this paper, we propose a method of overall optimal search and merger. At the same time, to the unreasonable problem of merging a segment which has non-value (value-segment) and a segment which values are zeros entirely (zeros-segment) to a large segment in Wang’s method, we also propose a corresponding method to solve the problem. The main techniques are incarnated in local cosine transform (LCT) algorithm for a single small segment, rather than folding processing using its original neighboring data, instead of making zeroextension, and then fold the each zero-extension segment. A great deal of numerical simulations validate that this new improved technique solves several problems of the binary-based segment algorithm and Wang’s segment algorithm, it not only obtains adapted effective segmentation result, but also there are not much more redundancy segmentations.